Transaction commit in a realistic timing model
نویسندگان
چکیده
منابع مشابه
Byzantine Generals and Transaction Commit Protocols
The transaction commit problem in a distributed database system is an instance of the Weak Byzantine Generals problem. It is shown that even under the assumption that a process can fail only by “crashing”—failing to send any more messages—a solution to this problem that can tolerate k failures must, in the worst case, require at least k + 1 message-passing delays. Under this same assumption, a ...
متن کاملTransaction Commit Protocol in Mobile Environment: A Survey
Mobile computing [2] is one of the most growing fields in recent days; a large number of researches are going on in the field of mobile computing for atomic commit protocol [1] for mobile transaction [3] in mobile environment. Various protocol are being proposed by various researchers for committing mobile transaction, most of them are based on the Two Phase Commit(2pc) protocol proposed by Jim...
متن کاملFaster Transaction Commit even when Nodes Crash
Atomic broadcasts play a central role in serialisable in-memory transactions. Best performing ones block, when a node crashes, until a new view is installed. We augment a new protocol for uninterrupted progress in the interim period.
متن کاملLaser: Load-Adaptive Group Commit in Lock-Free Transaction Logging
Log manager is a key component of DBMS and is considered as the most prominent bottleneck in the modern in-memory OLTP system. In this paper, by addressing two existing performance hurdles in the current procedure, we propose a high-performance transaction logging engine Laser and integrate it into OceanBase, an in-memory OLTP system. First, we present a lock-free transaction logging framework ...
متن کاملTo Commit or Not to Commit: Endogenous Timing in Experimental Duopoly Markets
In this paper, we experimentally investigate the extended game with action commitment of Hamilton and Slutsky (1990). In their duopoly game, ...rms can choose their quantities in one of two periods before the market clears. If a ...rm commits to a quantity in period 1 it does not know whether the other ...rm also commits early. By waiting until period 2, a ...rm can observe the other ...rm’s pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 1990
ISSN: 0178-2770,1432-0452
DOI: 10.1007/bf01786634